The complexity coefficient for acyclic networks measuring network density: Application to project management
نویسندگان
چکیده
منابع مشابه
Measuring Requirements Complexity to Increase the Probability of Project Success
The widespread adoption of Information Technology has helped reduce market problems caused by geographical separation and allow collaboration between organisations who are physically distributed around the globe. However, despite the successful strategic benefits brought by the evolution of the Internet and other web based services, this has not led to a higher project success rate. The biggest...
متن کاملAn application of artificial neural network to maintenance management
This study shows the usefulness of Artificial Neural Network (ANN) in maintenance planning and man-agement. An ANN model based on the multi-layer perceptron having three hidden layers and four processing elements per layer was built to predict the expected downtime resulting from a breakdown or a maintenance activity. The model achieved an accuracy of over 70% in predicting the expected downtime.
متن کاملMeasuring Complexity of Network and Service Management Components
Software metrics are currently used in the industry mainly for cost and effort estimation, while some research suggested their use as fault indicators. There are very few empirical studies in software measurement, especially in the realm of object-oriented metrics. There is no record of management system assessment using software metrics. In this paper we discuss the use of the established obje...
متن کاملRiemannian-geometric entropy for measuring network complexity.
A central issue in the science of complex systems is the quantitative characterization of complexity. In the present work we address this issue by resorting to information geometry. Actually we propose a constructive way to associate with a-in principle, any-network a differentiable object (a Riemannian manifold) whose volume is used to define the entropy. The effectiveness of the latter in mea...
متن کاملUniversal acyclic resolutions for arbitrary coefficient groups
We prove that for every compactum X and every integer n ≥ 2 there are a compactum Z of dim ≤ n + 1 and a surjective UV n−1-map r : Z −→ X such that for every abelian group G and every integer k ≥ 2 such that dimG X ≤ k ≤ n we have dimG Z ≤ k and r is G-acyclic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Social Sciences Research Journal
سال: 2019
ISSN: 2055-0286
DOI: 10.14738/assrj.62.6200